Incremental Unknowns and Graph Techniques with In-depth Refinement
نویسنده
چکیده
agonal (scaling) preconditioning is used, the condition number of the preconditioned incremental unknowns matrix associated to the Laplace operator is p(d)O((logd h) ) for the first order incremental unknowns, and q(d)O(| logd h|) for the second order incremental unknowns. For comparison, the condition number of the nodal unknowns matrix associated to the Laplace operator is O(1/h). Therefore, the incremental unknowns preconditioner is efficient with in-depth refinement, but its efficiency deteriorates at some rate as the depth of the refinement grows.
منابع مشابه
Grain Refinement Efficiency of Multi-Axial Incremental Forging and Shearing: A Crystal Plasticity Analysis
Severe plastic deformation is a technical method to produce functional material with special properties such as high strength and specific physical properties. Selection of an efficient severe plastic deformation for grain refinement is a challenging field of study and using a modeling technique to predict the refinement efficiency has gained a lot of attentions. A comparative study was carried...
متن کاملTwo point incremental forming of a complicated shape with negative and positive dies
In this work, incremental sheet forming of a complicated shape is investigated experimentally. Two point incremental forming with negative and positive dies are employed for manufacturing of a complicated shape with positive and negative truncated cones. The material is aluminum alloy 3105 with a thickness of 1 mm. The effects of process parameters such as sequence of positive and negative form...
متن کاملXX Incremental Bisimulation Abstraction Refinement
ion refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems. At the core of the refinement step lies the implicit or explicit analysis of a counterexample. This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on increme...
متن کاملON THE REFINEMENT OF THE UNIT AND UNITARY CAYLEY GRAPHS OF RINGS
Let $R$ be a ring (not necessarily commutative) with nonzero identity. We define $Gamma(R)$ to be the graph with vertex set $R$ in which two distinct vertices $x$ and $y$ are adjacent if and only if there exist unit elements $u,v$ of $R$ such that $x+uyv$ is a unit of $R$. In this paper, basic properties of $Gamma(R)$ are studied. We investigate connectivity and the girth of $Gamma(R)$, where $...
متن کاملInvestigation of Fracture Depth of Al/Cu Bimetallic Sheet in Single Point Incremental Forming Process
Single point incremental sheet forming (SPISF) has demonstrated significant potential to form complex sheet metal parts without using component-specific tools and is suitable for fabricating low-volume functional sheet metal parts economically. In the SPIF process, a ball nose tool moves along a predefined tool path to form the sheet. This work aims to optimize the formability and forming force...
متن کامل